Testability Improvement by Branch Point Control for Conditional Staements With Multiple Branches
نویسندگان
چکیده
High-level test synthesis (HLTS) methodologies have attracted much many research interest in recent years as digital design has moved to higher levels of abstraction. Conditional statements in behavioral descriptions tend to produce testability problems and have to be taken care of in the early stage of the design cycle. In this paper, we present an HLTS methodology for the Built-In Self-Test (BIST) environment. Our methods modify conditional case statements in the original design so as to control the number of test patterns applied to modules being tested. As a result, the number of required test patterns can be greatly reduced. This method is especially useful when there is a wide variance in the number of random test patterns required for functional units. Experimental results show that our methods achieve a high degree of fault coverage with a much smaller number of test patterns while the area and time overheads are negligible.
منابع مشابه
Block - Level Prediction for Wide - Issue Superscalar Processors
Changes in control ow, caused primarily by conditional branches, are a prime impediment to the performance of wide-issue superscalar processors. This paper investigates a block-level prediction scheme to mitigate the e ects of control ow changes caused by conditional branches. Instead of predicting the outcome of each conditional branch individually, this scheme predicts the target of a sequent...
متن کاملWish Branch: A New Control Flow Instruction Combining Conditional Branching and Predicated Execution
As processor pipelines get deeper and wider and instruction windows get larger, the branch misprediction penalty increases. Predication has been used to reduce the number of branch mispredictions by eliminating hard-to-predict branches. However, with predication, the processor is guaranteed to fetch and possibly execute useless instructions, which sometimes offsets the performance advantage of ...
متن کاملE ectively Exploiting Indirect Jumps
This paper describes a general code-improving transformation that can coalesce conditional branches into an indirect jump from a table. Applying this transformation allows an optimizer to exploit indirect jumps for many other coalescing opportunities besides the translation of multiway branch statements. First, dataaow analysis is performed to detect a set of coalescent conditional branches, wh...
متن کاملAn Integrated Partitioning and Scheduling Based Branch Decoupling
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate the penalties associated with conditional branch instructions. However, branches still constitute one of the main hurdles towards achieving higher ILP. Dynamic branch prediction relies on the temporal locality of and spa...
متن کاملBranch elimination by condition merging
Conditional branches are expensive. Branches require a significant percentage of execution cycles since they occur frequently and cause pipeline flushes when mispredicted. In addition, branches result in forks in the control flow, which can prevent other code-improving transformations from being applied. In this paper we describe profile-based techniques for replacing the execution of a set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 16 شماره
صفحات -
تاریخ انتشار 2000